An Efficient Algorithm for Sparse Code Motion
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Sparse Representations
Basis Pursuit (BP) and Basis Pursuit Denoising (BPDN), well established techniques for computing sparse representations, minimize an ` data fidelity term, subject to an ` sparsity constraint or regularization term, by mapping the problem to a linear or quadratic program. BPDN with an ` data fidelity term has recently been proposed, also implemented via a mapping to a linear program. We introduc...
متن کاملAn Efficient Sparse Code Fusion Method for Image Enhancement
Image enhancement can improve the perception of information for human viewers, which is also a basic and pretty significant role in image processing. However, there also exist some limitations in most image enhancement algorithms. In this paper discuss the limitations of existing techniques of image enhancement. In order to solve the limitations well, a novel sparse code fusion (SCF) method is ...
متن کاملMATLAB CODE FOR AN ENHANCED VIBRATING PARTICLES SYSTEM ALGORITHM
Vibrating particles system (VPS) is a new meta-heuristic algorithm based on the free vibration of freedom system’ single degree with viscous damping. In this algorithm, each agent gradually approach to its equilibrium position; new agents are generated according to current agents and a historically best position. Enhanced vibrating particles system (EVPS) employs a new alternative procedu...
متن کاملAn Efficient Search Algorithm for Motion Estimation
An efficient search algorithm using the principle of Hexagon-Based Search algorithm (HEXBS) for motion estimation called Hexagon-Based Fast Search algorithm (HEXFS) is proposed in this paper. The proposed algorithm combines the hexagon search algorithm and a two-step search algorithm which uses cross search patterns to reduce the huge calculation complexity. The experimental results show that t...
متن کاملAn Efficient Code Based Digital Signature Algorithm
In the case of most current digital signature algorithm can be attacked by quantum algorithm, code based digital signature algorithm, which represents the Post-Quantum Cryptography, has become the hotspot of current research. CFS algorithms proposed in 2001 is one of the most important code based digital signature algorithm, but its signature efficiency is very low. In this paper, an improved C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2005
ISSN: 1598-2831
DOI: 10.3745/kipsta.2005.12a.1.079